New Directions in Type-Theoretic Grammars
نویسنده
چکیده
This paper argues for the idea that in describing languagewe should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation. It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term representing its manifestation, but also to a lambda term representing its semantics.
منابع مشابه
Hybrid Type-Logical Grammars, First-Order Linear Logic and the Descriptive Inadequacy of Lambda Grammars
Hybrid type-logical grammars (Kubota & Levine 2012, Kubota & Levine 2013c, Kubota & Levine 2013a) are a relatively new framework in computational linguistics, which combines insights from the Lambek calculus (Lambek 1958) and lambda grammars (Oehrle 1994, Muskens 2001, Muskens 2003)— lambda grammars are also called, depending on the authors, abstract categorial grammars (de Groote 2001) and lin...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملTowards a Model-Theoretic Characterization of Indexed Grammars
The strong generative capacity of a certain type of indexed grammar is investigated within a model-theoretic framework. Such grammars are found to be equivalent in capacity to a certain fragment of a language obtained by the addition of unary function variables to a monadic second-order language previously used to characterize the context-free grammars.
متن کاملA Game-Theoretic Characterization of Boolean Grammars
We obtain a simple, purely game-theoretic characterization of Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation, 194(1) (2004) 19–48]. In particular, we propose a two-player infinite game of perfect information for Boolean grammars, which is equivalent to their well-founded semantics. The game is directly applicable to the simpler classes of conjunctive and context-fre...
متن کاملThe Grail theorem prover: Type theory for syntax and semantics
Type-logical grammars use a foundation of logic and type theory to model natural language. These grammars have been particularly successful giving an account of several well-known phenomena on the syntax-semantics interface, such as quantifier scope and its interaction with other phenomena. This chapter gives a highlevel description of a family of theorem provers designed for grammar developmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 19 شماره
صفحات -
تاریخ انتشار 2010